<title>「SNOI2017」炸弹</title><link href="http://hzoi.com/tomorrow.css" rel="stylesheet"><div class="ui existing segment"><pre><code><span class="pl-cp">#include</span><span class="pl-cpf">&lt;cstdio&gt;</span><span class="pl-cp"></span>
<span class="pl-cp">#include</span><span class="pl-cpf">&lt;cstring&gt;</span><span class="pl-cp"></span>
<span class="pl-cp">#include</span><span class="pl-cpf">&lt;cstdlib&gt;</span><span class="pl-cp"></span>
<span class="pl-cp">#include</span><span class="pl-cpf">&lt;algorithm&gt;</span><span class="pl-cp"></span>
<span class="pl-cp">#include</span><span class="pl-cpf">&lt;cmath&gt;</span><span class="pl-cp"></span>
<span class="pl-cp">#include</span><span class="pl-cpf">&lt;ctime&gt;</span><span class="pl-cp"></span>
<span class="pl-k">using</span> <span class="pl-k">namespace</span> <span class="pl-n">std</span><span class="pl-p">;</span>
<span class="pl-k">typedef</span> <span class="pl-kt">long</span> <span class="pl-kt">long</span> <span class="pl-n">LL</span><span class="pl-p">;</span>
<span class="pl-k">const</span> <span class="pl-n">LL</span> <span class="pl-n">mod</span><span class="pl-o">=</span><span class="pl-mf">1e9</span><span class="pl-o">+</span><span class="pl-mi">7</span><span class="pl-p">;</span>
<span class="pl-k">struct</span> <span class="pl-n">node</span><span class="pl-p">{</span><span class="pl-n">LL</span> <span class="pl-n">r</span><span class="pl-p">,</span><span class="pl-n">x</span><span class="pl-p">;}</span><span class="pl-n">w</span><span class="pl-p">[</span><span class="pl-mi">510000</span><span class="pl-p">];</span>
<span class="pl-kt">int</span> <span class="pl-n">n</span><span class="pl-p">,</span><span class="pl-n">p</span><span class="pl-p">[</span><span class="pl-mi">510000</span><span class="pl-p">];</span>
<span class="pl-kt">int</span> <span class="pl-n">lef</span><span class="pl-p">[</span><span class="pl-mi">510000</span><span class="pl-p">],</span><span class="pl-n">rig</span><span class="pl-p">[</span><span class="pl-mi">510000</span><span class="pl-p">];</span>
<span class="pl-n">LL</span> <span class="pl-n">minL</span><span class="pl-p">[</span><span class="pl-mi">510000</span><span class="pl-p">],</span><span class="pl-n">maxR</span><span class="pl-p">[</span><span class="pl-mi">510000</span><span class="pl-p">];</span>
<span class="pl-kt">void</span> <span class="pl-nf">pre</span><span class="pl-p">(</span><span class="pl-kt">int</span> <span class="pl-n">u</span><span class="pl-p">)</span>
<span class="pl-p">{</span>
    <span class="pl-k">while</span><span class="pl-p">(</span><span class="pl-mi">1</span><span class="pl-p">)</span>
    <span class="pl-p">{</span>
        <span class="pl-kt">bool</span> <span class="pl-n">bk</span><span class="pl-o">=</span><span class="pl-nb">false</span><span class="pl-p">;</span>
        <span class="pl-k">while</span><span class="pl-p">(</span><span class="pl-n">lef</span><span class="pl-p">[</span><span class="pl-n">u</span><span class="pl-p">]</span><span class="pl-o">&gt;</span><span class="pl-mi">1</span> <span class="pl-o">&amp;&amp;</span> <span class="pl-n">minL</span><span class="pl-p">[</span><span class="pl-n">u</span><span class="pl-p">]</span><span class="pl-o">&lt;=</span><span class="pl-n">w</span><span class="pl-p">[</span><span class="pl-n">lef</span><span class="pl-p">[</span><span class="pl-n">u</span><span class="pl-p">]</span><span class="pl-o">-</span><span class="pl-mi">1</span><span class="pl-p">].</span><span class="pl-n">x</span><span class="pl-p">)</span>
        <span class="pl-p">{</span>
            <span class="pl-n">minL</span><span class="pl-p">[</span><span class="pl-n">u</span><span class="pl-p">]</span><span class="pl-o">=</span><span class="pl-n">min</span><span class="pl-p">(</span><span class="pl-n">minL</span><span class="pl-p">[</span><span class="pl-n">u</span><span class="pl-p">],</span><span class="pl-n">minL</span><span class="pl-p">[</span><span class="pl-n">lef</span><span class="pl-p">[</span><span class="pl-n">u</span><span class="pl-p">]</span><span class="pl-o">-</span><span class="pl-mi">1</span><span class="pl-p">]);</span><span class="pl-n">maxR</span><span class="pl-p">[</span><span class="pl-n">u</span><span class="pl-p">]</span><span class="pl-o">=</span><span class="pl-n">max</span><span class="pl-p">(</span><span class="pl-n">maxR</span><span class="pl-p">[</span><span class="pl-n">u</span><span class="pl-p">],</span><span class="pl-n">maxR</span><span class="pl-p">[</span><span class="pl-n">lef</span><span class="pl-p">[</span><span class="pl-n">u</span><span class="pl-p">]</span><span class="pl-o">-</span><span class="pl-mi">1</span><span class="pl-p">]);</span>
            <span class="pl-n">rig</span><span class="pl-p">[</span><span class="pl-n">u</span><span class="pl-p">]</span><span class="pl-o">=</span><span class="pl-n">max</span><span class="pl-p">(</span><span class="pl-n">rig</span><span class="pl-p">[</span><span class="pl-n">u</span><span class="pl-p">],</span><span class="pl-n">rig</span><span class="pl-p">[</span><span class="pl-n">lef</span><span class="pl-p">[</span><span class="pl-n">u</span><span class="pl-p">]</span><span class="pl-o">-</span><span class="pl-mi">1</span><span class="pl-p">]);</span><span class="pl-n">lef</span><span class="pl-p">[</span><span class="pl-n">u</span><span class="pl-p">]</span><span class="pl-o">=</span><span class="pl-n">min</span><span class="pl-p">(</span><span class="pl-n">lef</span><span class="pl-p">[</span><span class="pl-n">u</span><span class="pl-p">],</span><span class="pl-n">lef</span><span class="pl-p">[</span><span class="pl-n">lef</span><span class="pl-p">[</span><span class="pl-n">u</span><span class="pl-p">]</span><span class="pl-o">-</span><span class="pl-mi">1</span><span class="pl-p">]);</span>
            <span class="pl-n">bk</span><span class="pl-o">=</span><span class="pl-nb">true</span><span class="pl-p">;</span>
        <span class="pl-p">}</span>
        <span class="pl-k">while</span><span class="pl-p">(</span><span class="pl-n">rig</span><span class="pl-p">[</span><span class="pl-n">u</span><span class="pl-p">]</span><span class="pl-o">&lt;</span><span class="pl-n">n</span> <span class="pl-o">&amp;&amp;</span> <span class="pl-n">maxR</span><span class="pl-p">[</span><span class="pl-n">u</span><span class="pl-p">]</span><span class="pl-o">&gt;=</span><span class="pl-n">w</span><span class="pl-p">[</span><span class="pl-n">rig</span><span class="pl-p">[</span><span class="pl-n">u</span><span class="pl-p">]</span><span class="pl-o">+</span><span class="pl-mi">1</span><span class="pl-p">].</span><span class="pl-n">x</span><span class="pl-p">)</span>
        <span class="pl-p">{</span>
            <span class="pl-n">minL</span><span class="pl-p">[</span><span class="pl-n">u</span><span class="pl-p">]</span><span class="pl-o">=</span><span class="pl-n">min</span><span class="pl-p">(</span><span class="pl-n">minL</span><span class="pl-p">[</span><span class="pl-n">u</span><span class="pl-p">],</span><span class="pl-n">minL</span><span class="pl-p">[</span><span class="pl-n">rig</span><span class="pl-p">[</span><span class="pl-n">u</span><span class="pl-p">]</span><span class="pl-o">+</span><span class="pl-mi">1</span><span class="pl-p">]);</span><span class="pl-n">maxR</span><span class="pl-p">[</span><span class="pl-n">u</span><span class="pl-p">]</span><span class="pl-o">=</span><span class="pl-n">max</span><span class="pl-p">(</span><span class="pl-n">maxR</span><span class="pl-p">[</span><span class="pl-n">u</span><span class="pl-p">],</span><span class="pl-n">maxR</span><span class="pl-p">[</span><span class="pl-n">rig</span><span class="pl-p">[</span><span class="pl-n">u</span><span class="pl-p">]</span><span class="pl-o">+</span><span class="pl-mi">1</span><span class="pl-p">]);</span>
            <span class="pl-n">lef</span><span class="pl-p">[</span><span class="pl-n">u</span><span class="pl-p">]</span><span class="pl-o">=</span><span class="pl-n">min</span><span class="pl-p">(</span><span class="pl-n">lef</span><span class="pl-p">[</span><span class="pl-n">u</span><span class="pl-p">],</span><span class="pl-n">lef</span><span class="pl-p">[</span><span class="pl-n">rig</span><span class="pl-p">[</span><span class="pl-n">u</span><span class="pl-p">]</span><span class="pl-o">+</span><span class="pl-mi">1</span><span class="pl-p">]);</span><span class="pl-n">rig</span><span class="pl-p">[</span><span class="pl-n">u</span><span class="pl-p">]</span><span class="pl-o">=</span><span class="pl-n">max</span><span class="pl-p">(</span><span class="pl-n">rig</span><span class="pl-p">[</span><span class="pl-n">u</span><span class="pl-p">],</span><span class="pl-n">rig</span><span class="pl-p">[</span><span class="pl-n">rig</span><span class="pl-p">[</span><span class="pl-n">u</span><span class="pl-p">]</span><span class="pl-o">+</span><span class="pl-mi">1</span><span class="pl-p">]);</span>
            <span class="pl-n">bk</span><span class="pl-o">=</span><span class="pl-nb">true</span><span class="pl-p">;</span>
        <span class="pl-p">}</span>
        <span class="pl-k">if</span><span class="pl-p">(</span><span class="pl-n">bk</span><span class="pl-o">==</span><span class="pl-nb">false</span><span class="pl-p">)</span><span class="pl-k">return</span> <span class="pl-p">;</span>
    <span class="pl-p">}</span>
<span class="pl-p">}</span>
<span class="pl-kt">int</span> <span class="pl-nf">main</span><span class="pl-p">()</span>
<span class="pl-p">{</span>
    <span class="pl-n">srand</span><span class="pl-p">(</span><span class="pl-n">time</span><span class="pl-p">(</span><span class="pl-mi">0</span><span class="pl-p">));</span>
    <span class="pl-n">scanf</span><span class="pl-p">(</span><span class="pl-s">&quot;%d&quot;</span><span class="pl-p">,</span><span class="pl-o">&amp;</span><span class="pl-n">n</span><span class="pl-p">);</span>
    <span class="pl-k">for</span><span class="pl-p">(</span><span class="pl-kt">int</span> <span class="pl-n">i</span><span class="pl-o">=</span><span class="pl-mi">1</span><span class="pl-p">;</span><span class="pl-n">i</span><span class="pl-o">&lt;=</span><span class="pl-n">n</span><span class="pl-p">;</span><span class="pl-n">i</span><span class="pl-o">++</span><span class="pl-p">)</span><span class="pl-n">scanf</span><span class="pl-p">(</span><span class="pl-s">&quot;%lld%lld&quot;</span><span class="pl-p">,</span><span class="pl-o">&amp;</span><span class="pl-n">w</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">].</span><span class="pl-n">x</span><span class="pl-p">,</span><span class="pl-o">&amp;</span><span class="pl-n">w</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">].</span><span class="pl-n">r</span><span class="pl-p">);</span>
    <span class="pl-k">for</span><span class="pl-p">(</span><span class="pl-kt">int</span> <span class="pl-n">i</span><span class="pl-o">=</span><span class="pl-mi">1</span><span class="pl-p">;</span><span class="pl-n">i</span><span class="pl-o">&lt;=</span><span class="pl-n">n</span><span class="pl-p">;</span><span class="pl-n">i</span><span class="pl-o">++</span><span class="pl-p">)</span><span class="pl-n">lef</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">]</span><span class="pl-o">=</span><span class="pl-n">rig</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">]</span><span class="pl-o">=</span><span class="pl-n">i</span><span class="pl-p">,</span><span class="pl-n">minL</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">]</span><span class="pl-o">=</span><span class="pl-n">w</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">].</span><span class="pl-n">x</span><span class="pl-o">-</span><span class="pl-n">w</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">].</span><span class="pl-n">r</span><span class="pl-p">,</span><span class="pl-n">maxR</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">]</span><span class="pl-o">=</span><span class="pl-n">w</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">].</span><span class="pl-n">x</span><span class="pl-o">+</span><span class="pl-n">w</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">].</span><span class="pl-n">r</span><span class="pl-p">;</span>
    <span class="pl-k">for</span><span class="pl-p">(</span><span class="pl-kt">int</span> <span class="pl-n">i</span><span class="pl-o">=</span><span class="pl-mi">1</span><span class="pl-p">;</span><span class="pl-n">i</span><span class="pl-o">&lt;=</span><span class="pl-n">n</span><span class="pl-p">;</span><span class="pl-n">i</span><span class="pl-o">++</span><span class="pl-p">)</span><span class="pl-n">p</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">]</span><span class="pl-o">=</span><span class="pl-n">i</span><span class="pl-p">;</span>
    <span class="pl-n">random_shuffle</span><span class="pl-p">(</span><span class="pl-n">p</span><span class="pl-o">+</span><span class="pl-mi">1</span><span class="pl-p">,</span><span class="pl-n">p</span><span class="pl-o">+</span><span class="pl-mi">1</span><span class="pl-o">+</span><span class="pl-n">n</span><span class="pl-p">);</span>
    <span class="pl-k">for</span><span class="pl-p">(</span><span class="pl-kt">int</span> <span class="pl-n">i</span><span class="pl-o">=</span><span class="pl-mi">1</span><span class="pl-p">;</span><span class="pl-n">i</span><span class="pl-o">&lt;=</span><span class="pl-n">n</span><span class="pl-p">;</span><span class="pl-n">i</span><span class="pl-o">++</span><span class="pl-p">)</span><span class="pl-n">pre</span><span class="pl-p">(</span><span class="pl-n">p</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">]);</span>
    <span class="pl-n">LL</span> <span class="pl-n">ans</span><span class="pl-o">=</span><span class="pl-mi">0</span><span class="pl-p">;</span>
    <span class="pl-k">for</span><span class="pl-p">(</span><span class="pl-n">LL</span> <span class="pl-n">i</span><span class="pl-o">=</span><span class="pl-mi">1</span><span class="pl-p">;</span><span class="pl-n">i</span><span class="pl-o">&lt;=</span><span class="pl-n">n</span><span class="pl-p">;</span><span class="pl-n">i</span><span class="pl-o">++</span><span class="pl-p">)</span><span class="pl-n">ans</span><span class="pl-o">=</span><span class="pl-p">(</span><span class="pl-n">ans</span><span class="pl-o">+</span><span class="pl-p">(</span><span class="pl-n">LL</span><span class="pl-p">)(</span><span class="pl-n">i</span><span class="pl-o">*</span><span class="pl-p">(</span><span class="pl-n">rig</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">]</span><span class="pl-o">-</span><span class="pl-n">lef</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">]</span><span class="pl-o">+</span><span class="pl-mi">1</span><span class="pl-p">))</span><span class="pl-o">%</span><span class="pl-n">mod</span><span class="pl-p">)</span><span class="pl-o">%</span><span class="pl-n">mod</span><span class="pl-p">;</span>
    <span class="pl-n">printf</span><span class="pl-p">(</span><span class="pl-s">&quot;%lld</span><span class="pl-se">\n</span><span class="pl-s">&quot;</span><span class="pl-p">,</span><span class="pl-n">ans</span><span class="pl-p">);</span>
    <span class="pl-k">return</span> <span class="pl-mi">0</span><span class="pl-p">;</span>
<span class="pl-p">}</span>
</cpde></pre></div>